Effect of CGMT Processors on Branch Prediction
نویسندگان
چکیده
CGMT can exert significant influence on the design and implementation of branch prediction. In this paper, the design of several typical branch predictors such as bimodel, GShare and McFarling is examined and branch prediction performance is improved by making some decisions with the help of TPC-W benchmark concerning whether to share some data structures among multiple threads or not. For a typical two-level adaptive branch predictor such as GShare, RAS & BHR should be kept thread private, BHT & BTB should be shared among threads. Also we make special effort to improve BTB hit rate besides keeping it shared. Algorithm called victim BTB with similar thought of victim cache is presented and a couple of variant algorithm, inter-thread victim BTB and intra-thread victim BTB are described in detail. Experimental results show that BTB hit rate is improved considerably when BTB size is not very large.
منابع مشابه
Delayed Branches Versus Dynamic Branch Prediction in a High- Performance Superscalar Architecture
While delayed branch mechanisms were popular with the designers of RISC processors, most superscalar processors deploy dynamic branch prediction to minimise run-time branch penalties. We propose a generalised branch delay mechanism that is more suited to superscalar processors. We then quantitatively compare the performance of our delayed branch mechanism with run-time branch prediction, in the...
متن کاملDynamic branch prediction and control speculation
Branch prediction schemes have become an integral part of today’s superscalar processors. They are one of the key issues in enhancing the performance of processors. Pipeline stalls due to conditional branches are one of the most significant impediments to realise the performance potential of superscalar processors. Many schemes for branch prediction, that can effectively and accurately predict ...
متن کاملBlock - Level Prediction for Wide - Issue Superscalar Processors
Changes in control ow, caused primarily by conditional branches, are a prime impediment to the performance of wide-issue superscalar processors. This paper investigates a block-level prediction scheme to mitigate the e ects of control ow changes caused by conditional branches. Instead of predicting the outcome of each conditional branch individually, this scheme predicts the target of a sequent...
متن کاملLow-power branch prediction techniques for VLIW architectures: a compiler-hints based approach
The paper introduces a dynamic branch prediction scheme suitable for energy-aware Very Long Instruction Word (VLIW) processors. The proposed technique is based on a compiler hint mechanism to filter the accesses to the branch predictor blocks. We define a configurable hint instruction which anticipates some static information about the upcoming branch to reduce the hardware involved in the pred...
متن کاملA Framework to Model Branch Prediction for Worst Case Execution Time Analysis
Estimating the Worst Case Execution Time (WCET) of a program on a given hardware platform is useful in the design of embedded real-time systems. These systems communicate with the external environment in a timely fashion, and thus impose constraints on the execution time of programs. Estimating the WCET of a program ensures that these constraints are met. WCET analysis schemes typically model m...
متن کامل